package algorithm;

public class Complexity {
    // 请计算一下Func1基本操作执行了多少次？
    void Func1(int N)
    {
        int count = 0;
        for (int i = 0; i < N; ++i)    // 第一段
        {
            for (int j = 0; j < N; ++j)
            {
                ++count;
            }
        }
        for (int k = 0; k < 2 * N; ++k)
        {
            ++count;
        }
        int M = 10;
        while (M<10)
        {
            M=M--;
            ++count;
        }
    }

    public static void main(String[] args) {
        boolean count = false;
        System.out.println(count);
    }
}
